1

Dempster's rule of combination is #P-complete

Year:
1990
Language:
english
File:
PDF, 399 KB
english, 1990
3

Optimization, block designs and No Free Lunch theorems

Year:
2005
Language:
english
File:
PDF, 104 KB
english, 2005
5

Probably approximately optimal satisficing strategies

Year:
1996
Language:
english
File:
PDF, 1.59 MB
english, 1996
8

The density and complexity of polynomial cores for intractable sets

Year:
1986
Language:
english
File:
PDF, 747 KB
english, 1986
9

Computing with truly asynchronous threshold logic networks

Year:
1997
Language:
english
File:
PDF, 946 KB
english, 1997
10

Random Strings Make Hard Instances

Year:
1996
Language:
english
File:
PDF, 271 KB
english, 1996
13

Instance complexity

Year:
1994
Language:
english
File:
PDF, 1.54 MB
english, 1994
14

The Computational Power of Discrete Hopfield Nets with Hidden Units

Year:
1996
Language:
english
File:
PDF, 686 KB
english, 1996
15

Witness of unsatisfiability for a random 3-satisfiability formula

Year:
2013
Language:
english
File:
PDF, 428 KB
english, 2013
16

Design methods for 3D wireframe DNA nanostructures

Year:
2017
Language:
english
File:
PDF, 7.39 MB
english, 2017
19

OnP-subset structures

Year:
1987
Language:
english
File:
PDF, 535 KB
english, 1987
22

Attraction Radii in Binary Hopfield Nets are Hard to Compute

Year:
1993
Language:
english
File:
PDF, 516 KB
english, 1993
23

A classification of complexity core lattices

Year:
1986
Language:
english
File:
PDF, 601 KB
english, 1986
24

Online bin packing with delay and holding costs

Year:
2013
Language:
english
File:
PDF, 230 KB
english, 2013
27

Exponential transients in continuous-time Liapunov systems

Year:
2003
Language:
english
File:
PDF, 430 KB
english, 2003
31

Continuous-Time Symmetric Hopfield Nets Are Computationally Universal

Year:
2003
Language:
english
File:
PDF, 614 KB
english, 2003
34

Optimal Approximations and Polynomially Levelable Sets

Year:
1986
Language:
english
File:
PDF, 1.18 MB
english, 1986